Deterministic Annealing and Chaotic Annealing in a Neural Approach to Quadratic Assignment Problem
نویسنده
چکیده
In this article, we discuss deterministic annealing and chaotic annealing, when doubly constrained network (DCN) is applied to quadratic assignment problem. The two algorithms are compared in several aspects; they are bifurcation structures, obtained solutions, and parameter determination.
منابع مشابه
A Honey Bee Algorithm To Solve Quadratic Assignment Problem
Assigning facilities to locations is one of the important problems, which significantly is influence in transportation cost reduction. In this study, we solve quadratic assignment problem (QAP), using a meta-heuristic algorithm with deterministic tasks and equality in facilities and location number. It should be noted that any facility must be assign to only one location. In this paper, first o...
متن کاملA hybrid CS-SA intelligent approach to solve uncertain dynamic facility layout problems considering dependency of demands
This paper aims at proposing a quadratic assignment-based mathematical model to deal with the stochastic dynamic facility layout problem. In this problem, product demands are assumed to be dependent normally distributed random variables with known probability density function and covariance that change from period to period at random. To solve the proposed model, a novel hybrid intelligent algo...
متن کاملReducing Interference in the Mobile Two-Tier Ad Hoc and Wireless Sensor Networks with the Help of Stochastic Chaotic Simulated Annealing
In this paper, a very efficient approach to reducing interference in mobile ad hoc and wireless sensor networks is proposed. The approach uses chaotic simulated annealing (CSA). The basic concept of this method was formulated as a channel assignment problem (CAP). The solution of the CAP problem is based here on neural networks which are able to find a conflictfree frequency assignment for the ...
متن کاملChannel Assignment for Mobile Communications Using Stochastic Chaotic Simulated Annealing
The channel assignment problem (CAP), the task to assign the required number of channels to each radio cell in such a way that interference is precluded and the frequency spectrum is used efficiently, is known to be an NP-complete optimization problem. In this paper, we solve CAP using a stochastic chaotic neural network that we proposed recently. The performance of stochastic chaotic simulated...
متن کاملPerformance Evaluation of a Convex Relaxation Approach to the Quadratic Assignment of Relational Object Views
We introduce a recently published convex relaxation approach for the quadratic assignment problem to the field of computer vision. Due to convexity, a favourable property of this approach is the absence of any tuning parameters and the computation of high–quality combinatorial solutions by solving a mathematically simple optimization problem. Furthermore, the relaxation step always computes a t...
متن کامل